Arithmetic Equality Constraints as C++ Statements

نویسنده

  • Christopher J. Van Wyk
چکیده

A computer program in a conventional (imperative) language provides an explicit sequence of instructions by which to compute the desired answer. A program in a declarative language, by contrast, expresses conditions that the answer should satisfy; it is up to an implementation of the language to compute an appropriate answer. The usefulness of declarative programming has been recognized for decades, especially for graphics; Leler l summarizes earlier work, including that of Sutherland, 2 Borning, 3 and Van Wyk. 4 This article describes how one can add some declarative features to the (imperative) C++ language, using only features of and functions written in the language itself

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing a Complete Basis for Equalities Implied by a System of LRA Constraints

We present three new methods that investigate the equalities implied by a system of linear arithmetic constraints. Implied equalities can be used to simplify linear arithmetic constraints and are valuable in the context of Nelson-Oppen style combinations of theories. The first method efficiently checks whether a system of linear arithmetic constraints implies an equality at all. In case the sys...

متن کامل

Solving Sparse Linear Constraints

Linear arithmetic decision procedures form an important part of theorem provers for program verification. In most verification benchmarks, the linear arithmetic constraints are dominated by simple difference constraints of the form x ≤ y + c. Sparse linear arithmetic (SLA) denotes a set of linear arithmetic constraints with a very few non-difference constraints. In this paper, we propose an eff...

متن کامل

New techniques for linear arithmetic: cubes and equalities

We present several new techniques for linear arithmetic constraint solving. They are all based on the linear cube transformation, a method presented here, which allows us to efficiently determine whether a system of linear arithmetic constraints contains a hypercube of a given edge length. Our first findings based on this transformation are two sound tests that find integer solutions for linear...

متن کامل

Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic

Can complexity classes be characterized in terms of efficient reducibility to the (undecidable) set of Kolmogorov-random strings? Although this might seem improbable, a series of papers has recently provided evidence that this may be the case. In particular, it is known that there is a class of problems C defined in terms of polynomial-time truth-table reducibility to RK (the set of Kolmogorov-...

متن کامل

The generative basis of natural number concepts.

Number concepts must support arithmetic inference. Using this principle, it can be argued that the integer concept of exactly ONE is a necessary part of the psychological foundations of number, as is the notion of the exact equality - that is, perfect substitutability. The inability to support reasoning involving exact equality is a shortcoming in current theories about the development of numer...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Softw., Pract. Exper.

دوره 22  شماره 

صفحات  -

تاریخ انتشار 1992